Robust Incentives via Multi-level Tit-for-tat
نویسندگان
چکیده
Much work has been done to address the need for incentive models in real deployed peer-to-peer networks. In this paper, we discuss problems found with the incentive model in a large, deployed peer-to-peer network, Maze. We evaluate several alternatives, and propose an incentive system that generates preferences for wellbehaved nodes while correctly punishing colluders. We discuss our proposal as a hybrid between Tit-for-Tat and EigenTrust, and show its effectiveness through simulation of real traces of the Maze system.
منابع مشابه
Intelligent tit-for-tat in the iterated prisoner's dilemma game.
We seek a route to the equilibrium where all the agents cooperate in the iterated prisoner's dilemma game on a two-dimensional plane, focusing on the role of tit-for-tat strategy. When a time horizon, within which a strategy can recall the past, is one time step, an equilibrium can be achieved as cooperating strategies dominate the whole population via proliferation of tit-for-tat. Extending th...
متن کاملDandelion: Cooperative Content Distribution with Robust Incentives
Content distribution via the Internet is becoming increasingly popular. To be cost-effective, commercial content providers are considering the use of peer-to-peer (P2P) protocols such as BitTorrent to save on bandwidth costs and to handle peak demands. However, when an online content provider uses a P2P protocol, it faces a crucial issue: how to incentivize its clients to upload to their peers....
متن کاملAn Energy-Aware Multi-Core Scheduler based on Generalized Tit-For-Tat Cooperative Game
Energy-constrained computing environments are emerging those years, especially in embedding computing. A game theoretic energy-aware scheduling algorithm for multicore systems is proposed in this paper, namely, GTFTES (Generalized Tit-For-Tat Energy-aware Scheduling). GTFTES is designed to work in a resource-rich environment where resources always compete for tasks. A generalized Tit-for-Tat ba...
متن کاملChunkyspread: Multi-tree Unstructured Peer-to-Peer Multicast
The latest debate in P2P and overlay multicast systems is whether or not to build trees. The main argument on the anti-tree side is that tree construction is complex, and that trees are fragile. The main counter-argument is that non-tree systems have a lot of overhead. In this paper, we argue that you can have it both ways: that one can build multi-tree systems with simple and scalable algorith...
متن کاملA Network Formation Game Approach to Study BitTorrent Tit-for-Tat
The Tit-for-Tat strategy implemented in BitTorrent (BT) clients is generally considered robust to selfish behaviours. The authors of [1] support this belief studying how Tit-for-Tat can affect selfish peers who are able to set their upload bandwidth. They show that there is a “good” Nash Equilibrium at which each peer uploads at the maximum rate. In this paper we consider a different game where...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Concurrency and Computation: Practice and Experience
دوره 20 شماره
صفحات -
تاریخ انتشار 2006